Formal language theory: refining the Chomsky hierarchy.
نویسندگان
چکیده
The first part of this article gives a brief overview of the four levels of the Chomsky hierarchy, with a special emphasis on context-free and regular languages. It then recapitulates the arguments why neither regular nor context-free grammar is sufficiently expressive to capture all phenomena in the natural language syntax. In the second part, two refinements of the Chomsky hierarchy are reviewed, which are both relevant to the extant research in cognitive science: the mildly context-sensitive languages (which are located between context-free and context-sensitive languages), and the sub-regular hierarchy (which distinguishes several levels of complexity within the class of regular languages).
منابع مشابه
1 Formal Language Theory
This chapter provides a gentle introduction to formal language theory, aimed at readers with little background in formal systems. The motivation is natural language processing (NLP), and the presentation is geared towards NLP applications, with linguistically motivated examples, but without compromising mathematical rigor. The text covers elementary formal language theory, including: regular la...
متن کاملFormal Properties of Categorial Grammars
We discuss two standard formal tools used to study models of grammar. One of these is formal language theory, which provides a way to describe the complexity of languages in terms of a sequence of standard language classes known as the Chomsky hierarchy. The other tool is learnability theory, which can describe, for a given class of languages, whether or not there exists a single learner that c...
متن کاملG-automata, Counter Languages and the Chomsky Hierarchy
We consider how the languages of G-automata compare with other formal language classes. We prove that if the word problem of G is accepted by a machine in the class M then the language of any G-automaton is in the class M. It follows that the so called counter languages (languages of Zn-automata) are context-sensitive, and further that counter languages are indexed if and only if the word probl...
متن کاملA New Approach to Formal Language Theory by Kolmogorov Complexity
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate deterministic context-free languages and nondeterministic context-free languages. The use of the new ‘incompressibility arguments’ is illustrated by many examples. The ...
متن کاملProving Parikh's theorem using Chomsky-Schutzenberger theorem
Parikh theorem was originally stated and proved by Rohkit Parikh in MIT research report in 1961. Many different proofs of this classical theorems were produced then; our goal is to give another proof using Chomsky-Schutzenberger representation theorem. We present the proof which doesn't use any formal language theory tool at all except the representation theorem, just some linear algebra.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Philosophical transactions of the Royal Society of London. Series B, Biological sciences
دوره 367 1598 شماره
صفحات -
تاریخ انتشار 2012